Approximation Algorithms for 3D Orthogonal Knapsack
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Constrained Knapsack Problems
We study constrained versions of the knapsack problem in which dependencies between items are given by a graph. In one version, an item can be selected only if one of its neighbours is also selected. In the other version, an item can be selected only when all its neighbours are also selected. These problems generalize and unify several problems including the prize collecting and budgeted maximu...
متن کاملImproved Approximation Algorithms for a Bilevel Knapsack Problem
Article history: Received 20 September 2014 Received in revised form 13 May 2015 Accepted 13 June 2015 Available online 19 June 2015 Communicated by X. Deng
متن کاملApproximation Algorithms for Knapsack Problems with Cardinality Constraintsy
We address a variant of the classical knapsack problem in which an upper bound is imposed on the number of items that can be selected. This problem arises in the solution of real-life cutting stock problems by column generation, and may be used to separate cover inequalities with small support within cutting plane approaches to integer linear programs. We focus our attention on approximation al...
متن کاملApproximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
Motivated by a real world application, we study the multiple knapsack problem with assignment restrictions (MKAR). We are given a set of items, each with a positive real weight, and a set of knapsacks, each with a positive real capacity. In addition, for each item a set of knapsacks that can hold that item is specified. In a feasible assignment of items to knapsacks, each item is assigned to at...
متن کاملDistributed Approximation Algorithms for the Multiple Knapsack Problem
We consider the distributed version of the Multiple Knapsack Problem (MKP), wherem items are to be distributed amongst n processors, each with a knapsack. We propose different distributed approximation algorithms with a tradeoff between time and message complexities. The algorithms are based on the greedy approach of assigning the best item to the knapsack with the largest capacity. These algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Technology
سال: 2008
ISSN: 1000-9000,1860-4749
DOI: 10.1007/s11390-008-9170-7